quasiconvexprogramming

A model for engineering design, which provides both the expected total cost and cost variance, is developed based upon division of the elements of variability ...

由 A Agrawal 著作 · 2020 · 被引用 42 次 — Disciplined quasiconvex programming generalizes disciplined convex programming, the class of optimization problems targeted by most modern.

由 DG Luenberger 著作 · 1968 · 被引用 159 次 — 5, September 1968. Printed in U.S.A.. QUASI-CONVEX PROGRAMMING*. DAVID G. LUENBERGERt. 1. Introduction. In differential form, the Kuhn-Tucker theorem and the ...

Quasiconvex programming is a generalization of convex programming. ... Quasiconvex programming is used in the solution of surrogate dual problems, whose biduals ...

由 JAS Gromicho 著作 · 被引用 78 次 — More recently, this algorithm has been used by Carrizosa and Plastria to solve a global optimization problem in facility location (Ref. [16]). The distinction ...

由 Q Ke 著作 · 被引用 234 次 — Geometric reconstruction problems in computer vision are often solved by minimizing a cost function that combines the reprojection errors in the 2D images.

由 A Agrawal 著作 · 2019 · 被引用 42 次 — We describe an implementation of disciplined quasiconvex programming that makes it possible to specify and solve quasiconvex programs in CVXPY ...

由 D Eppstein 著作 · 2004 · 被引用 42 次 — Abstract: We define quasiconvex programming, a form of generalized linear programming in which one seeks the point minimizing the pointwise ...